A Note About Critical Percolation on Finite Graphs

In this note we study the geometry of the largest component C₁\mathcal {C}_{1} of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. (Random Struct. Algorithms 27:137–184, 2005). There it is shown that this component is of size n ^2/3, and here we show that its diameter is n ^1/3 and that the simple random walk takes n steps to mix on it. By Borgs et al. (Ann. Probab. 33:1886–1944, 2005), our results apply to critical percolation on several high-dimensional finite graphs such as the finite torus \mathbbZ_n^d\mathbb{Z}_{n}^{d} (with d large and n→∞) and the Hamming cube {0,1} ⁿ .     

Development of a rapid-scan fiber-integrated terahertz spectrometer

Scientists in terahertz (THz) wave technologies have benefited from the recent developments in ultrafast laser technologies and RF technologies and applied these new gained techniques into characterizing a wide variety of phenomena. Undoubtedly, the most successful of these applications has been in the development of time-domain terahertz spectroscopic and imaging systems which has been utilized in the characterization of dielectrics and semiconductors. This pulsed technique has allowed users to characterize dynamical behavior inside materials under illumination with picosecond resolution. Typically pump/probe or similar dynamical measurements require the use of amplified pulses derived from free-space solid state lasers in the $\upmu $ J–mJ range and since interferometric techniques are typically used in pulsed measurements the measurement time of a THz spectrum can last at least tens of minutes. Better systems can be realized based on fiber laser technologies. Here we discuss the advantages of a THz spectrometer driven by an ultrafast Ytterbium doped fiber laser whose repetition rate can be tuned rapidly allowing for rapid dynamical measurements. The efficient gain medium, robust operation and compact design of the system opens up the possibility of exploring rapid detection of various materials as well as studying dynamical behavior using the high brightness source.     

Ramsey Theory,integer partitions and a new proof of the Erdős–Szekeres Theorem

Let H be a k  -uniform hypergraph whose vertices are the integers 1,…,N$1,\dots ,N$. We say that H contains a monotone path of length n   if there are _x1<_x2<?<_xn+k−1$x_1<x_2<?<x_{n+k-1}$ so that H contains all n   edges of the form {_xi,_xi+1,…,_xi+k−1}$\{x_i,x_{i+1},\dots ,x_{i+k-1}\}$. Let _Nk(q,n)$N_k(q,n)$ be the smallest integer N so that every q-coloring of the edges of the complete k-uniform hypergraph on N vertices contains a monochromatic monotone path of length n  . While the study of _Nk(q,n)$N_k(q,n)$ for specific values of k and q   goes back (implicitly) to the seminal 1935 paper of Erd?s and Szekeres, the problem of bounding _Nk(q,n)$N_k(q,n)$ for arbitrary k and q was studied by Fox, Pach, Sudakov and Suk.     

Universality of random graphs and rainbow embedding

In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of . Let the maximum density of a graph H be the maximum average degree of all the subgraphs of H. First, we show that for , a graph w.h.p. contains copies of all spanning graphs H with maximum degree at most Δ and maximum density at most d. For , this improves a result of Dellamonica, Kohayakawa, Rödl and Rucińcki. Next, we show that if we additionally restrict the spanning graphs to have girth at least 7 then the random graph contains w.h.p. all such graphs for . In particular, if , the random graph therefore contains w.h.p. every spanning tree with maximum degree bounded by Δ. This improves a result of Johannsen, Krivelevich and Samotij. Finally, in the same spirit, we show that for any spanning graph H with constant maximum degree, and for suitable p, if we randomly color the edges of a graph with colors, then w.h.p. there exists a rainbow copy of H in G (that is, a copy of H with all edges colored with distinct colors). © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 546–564, 2016     

Bin packing with general cost structures

Following the work of Anily et?al., we consider a variant of bin packing called bin packing with general cost structures (GCBP) and design an asymptotic fully polynomial time approximation scheme (AFPTAS) for this problem. In the classic bin packing problem, a set of one-dimensional items is to be assigned to subsets of total size at most 1, that is, to be packed into unit sized bins. However, in GCBP, the cost of a bin is not 1 as in classic bin packing, but it is a non-decreasing and concave function of the number of items packed in it, where the cost of an empty bin is zero. The construction of the AFPTAS requires novel techniques for dealing with small items, which are developed in this work. In addition, we develop a fast approximation algorithm which acts identically for all non-decreasing and concave functions, and has an asymptotic approximation ratio of 1.5 for all functions simultaneously.     

Coloring complete bipartite graphs from random lists

Let K_n,n be the complete bipartite graph with n vertices in each side. For each vertex draw uniformly at random a list of size k from a base set S of size s = s(n). In this paper we estimate the asymptotic probability of the existence of a proper coloring from the random lists for all fixed values of k and growing n. We show that this property exhibits a sharp threshold for k ≥ 2 and the location of the threshold is precisely s(n) = 2n for k = 2 and approximately for k ≥ 3. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

High-multiplicity N-fold IP via configuration LP

Mathematical Programming - N-fold integer programs (IPs) form an important class of block-structured IPs for which increasingly fast algorithms have recently been developed and successfully...